VieM v1.00 - Vienna Mapping and Sparse Quadratic Assignment User Guide
نویسندگان
چکیده
This paper severs as a user guide to the mapping framework VieM (Vienna Mapping and Sparse Quadratic Assignment). We give a rough overview of the techniques used within the framework and describe the user interface as well as the file formats used.
منابع مشابه
Better Process Mapping and Sparse Quadratic Assignment
Communication and topology aware process mapping is a powerful approach to reduce communication time in parallel applications with known communication patterns on large, distributed memory systems. We address the problem as a quadratic assignment problem (QAP), and present algorithms to construct initial mappings of processes to processors as well as fast local search algorithms to further impr...
متن کاملA GRASP for the Biquadratic Assignment Problem
routines for approximate solution of dense quadratic assignment problems A greedy randomized adaptive search procedure for the quadratic assignment problem, in Quadratic assign-for approximate solution of sparse quadratic assignment problems using
متن کاملTightening a Discrete Formulation of the Quadratic Assignment Problem
The quadratic assignment problem is a well studied and notoriously difficult combinatorial problem. Recently, a discrete linear formulation of the quadratic assignment problem was presented that solved five previously unsolved instances from the quadratic assignment library, QAPLIB, to optimality. That formulation worked especially well on sparse instances. In this paper we show how to tighten ...
متن کاملPower Control and Scheduling For Low SNR Region in the Uplink of Two Cell Networks
In this paper we investigate the sub-channel assignment and power control to maximize the total sum rate in the uplink of two-cell network. It is assumed that there are some sub-channels in each cell which should be allocated among some users. Also, each user is subjected to a power constraint. The underlying problem is a non-convex mixed integer non-linear optimization problem which does not h...
متن کاملImproved Discrete Reformulations for the Quadratic Assignment Problem
This paper presents an improved as well as a completely new version of a mixed integer linear programming (MILP) formulation for solving the quadratic assignment problem (QAP) to global optimum. Both formulations work especially well on instances where at least one of the matrices is sparse. Modification schemes, to decrease the number of unique elements per row in symmetric instances, are pres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1703.05509 شماره
صفحات -
تاریخ انتشار 2017